The Complexity of some Problems Related to Graph 3-colorability
نویسندگان
چکیده
It is well-known that the GRAPH 3.COLORABILITY problem, deciding whether a given graph has a stable set whose deletion results in a bipartite graph, is NP-complete. We prove the following related theorems: It is NP-complete to decide whether a graph has a stable set whose deletion results in (1) a tree or (2) a trivially perfect graph, and there is a polynomial algorithm to decide if a given graph has a stable set whose deletion results in (3) the complement of a bipartite graph, (4) a split graph or (5) a threshold graph.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملExact Complexity of Exact-Four-Colorability
Let Mk ⊆ N be a given set that consists of k noncontiguous integers. Define Exact-Mk-Colorability to be the problem of determining whether χ(G), the chromatic number of a given graph G, equals one of the k elements of the set Mk exactly. In 1987, Wagner [Wag87] proved that Exact-Mk-Colorability is BH2k(NP)-complete, where Mk = {6k + 1, 6k + 3, . . . , 8k − 1} and BH2k(NP) is the 2kth level of t...
متن کاملPlanar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 ≤ i ≤ j ≤ 7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.
متن کاملComplexity of the conditional colorability of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r, d(v)} different colors. The smallest integer k for which a graph G has a conditional (k, r)-coloring is called the rth order conditional chromatic number, denoted by χr(G). It is easy to see that th...
متن کاملComplexity of clique coloring and related problems
A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that every maximal (i.e., not extendable) clique of G contains two vertices with different colors. We show that deciding whether a graph has a k-clique-coloring is Σ 2 -complete for every k ≥ 2. The complexity of two related problems are also considered. A graph is k-clique-choosable, if for every k-list-ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 89 شماره
صفحات -
تاریخ انتشار 1998